How to Believe a Twelf Proof
نویسندگان
چکیده
Logical systems are represented in LF by giving a full and faithful (adequate) embedding of the deductive apparatus of the logic as canonical forms of certain types and kinds in LF in specified contexts. The collection of contexts over which the representation is adequate is called a world, because it provides generators for the canonical forms in question. Transferring adequacy from one world to another relies on the concept of subordination, which expresses the irrelevance of any “extra” variables in the target world. Given such a representation any metatheoretic property of the logic may be stated and proved in terms of its representation as certain canonical forms. The Twelf meta-theorem prover for LF supports mechanical verification of Π2 (∀∃) sentences that quantify over canonical forms of specified types. The proof of such a Π2 proposition may be seen as a totality proof for an associated relation, with the universal variables designated as “inputs” and the existential variables designated as “outputs”. Such totality proofs often take the form of a lexicographic induction over the structure of various canonical forms. The representation of a logic typically involves higher types of LF; this is called higher-order abstract syntax. Exploiting the LF type structure typically streamlines the presentation, but does not in any way inhibit the expressive power of the Twelf theorem prover. This is because the theorem prover works at the meta-level of LF by induction over the structure of canonical forms of higher type. It is frequently alleged that logical relations arguments cannot be formalized in LF. This is not so; LF is capable of encoding nearly any logic in which a logic relations argument might be expressed. What is true, however, is that the Twelf meta-logic, being limited to Π2 sentences, cannot express meta-theorems whose proof proceeds by logical relations. The reason is that the core idea of logical relations is that the logical complexity of the theorem varies in proportion to
منابع مشابه
Towards a Judgmental Reconstruction of Logical Relation Proofs
Tait’s method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed lambda-calculi. Historically, these proofs have been difficult to formalize in proof assistants with weak meta-logics, such as Twelf. Logical relations are notoriously difficult to define judgmentally. In this paper, we present and discu...
متن کاملNormalization for the Simply-Typed Lambda-Calculus in Twelf
Normalization for the simply-typed λ-calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait’s computability method does not seem to be directly usable, a syntactical proof is adapted and formalized instead. In this case study, some boundaries of Twelf current capabilities are touched and discussed.
متن کاملThesis Proposal: Practical Automated Theorem Proving with the Polarized Inverse Method
Formal, mechanically checked reasoning as envisioned by Leibniz has in the past few decades become a reality. Proof assistants are programs that can rigorously and mechanically check the details of logical arguments. Formal reasoning supported by proof assistants has applications to nearly all areas of computer science, from formal including specifying and verifying critical properties of hardw...
متن کاملWeak Normalization for the Simply-Typed Lambda-Calculus in Twelf
Weak normalization for the simply-typed λ-calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait’s computability method does not seem to be directly usable, a combinatorical proof is adapted and formalized instead.
متن کاملFourth International Workshop on Logical Frameworks and Meta-Languages (LFM’04)
Weak normalization for the simply-typed λ-calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait’s computability method does not seem to be directly usable, a combinatorical proof is adapted and formalized instead.
متن کامل